An active set algorithm for nonlinear optimization with polyhedral constraints
نویسنده
چکیده
A polyhedral active set algorithm PASA is developed for solving a nonlinear optimization problem whose feasible set is a polyhedron. Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem. Rules are provided for branching between the two phases. Global convergence to a stationary point is established, while asymptotically PASA performs only phase two when either a nondegeneracy assumption holds, or the active constraints are linearly independent and a strong second-order sufficient optimality condition holds.
منابع مشابه
Optimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملOn the optimization of Dombi non-linear programming
Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...
متن کاملReliability Optimization for Complicated Systems with a Choice of Redundancy Strategies (TECHNICAL NOTE)
Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...
متن کاملProjection onto a Polyhedron that Exploits Sparsity
An algorithm is developed for projecting a point onto a polyhedron. The algorithm solves a dual version of the projection problem and then uses the relationship between the primal and dual to recover the projection. The techniques in the paper exploit sparsity. Sparse reconstruction by separable approximation (SpaRSA) is used to approximately identify active constraints in the polyhedron, and t...
متن کامل